Characterization of strongly regular integral circulant graphs by spectral approach
نویسندگان
چکیده
The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . , n? 1} and vertices a b are adjacent if gcd(a ? b, n) D, where D Dn, Dn {d : d | n, 1 < n}. Motivated by incorrect proof of previously published result, in this paper we characterize class graphs that strongly regular. More precisely, connected is regular only n composite m d} for some 2.
منابع مشابه
Strongly Regular Integral Circulant Graphs and Their Energies
Let S ⊂ Zn be a finite cyclic group of order n > 1. Assume that 0 / ∈ S and −S = {−s : s ∈ S} = S. The circulant graph G = Cir(n, S) is the undirected graph having the vertex set V (G) = Zn and edge set E(G) = {ab : a, b ∈ Zn, a− b ∈ S}. Let D be a set of positive, proper divisors of the integer n. We characterize certain strongly regular integral circulant graphs with energy 2n(1− 1/d) for a f...
متن کاملQuasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph Γ with diameter d is strongly distance-regular if Γ is distanceregular and its distance-d graph Γd is strongly regular. The known examples are all the connected strongly regular graphs (i.e. d = 2), all the antipodal distanceregular graphs, and some distance-regular graphs with diameter d = 3. The main result in this paper is a characterization of these graphs (among regular graphs with...
متن کاملSpectral Graph Theory Lecture 24 Strongly Regular Graphs , part 2
In this lecture, I will present three results related to Strongly Regular Graphs. 1. An algorithm for testing isomorphism of SRGs that runs in time 2 O(√ n log n). 2. A proof that f and g, the dimensions of the eigenspaces, are both at least √ n. The problem of testing isomorphism of graphs is often reduced to the problem of giving each vertex in a graph a unique name. If we have a way of doing...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2022
ISSN: ['1452-8630', '2406-100X']
DOI: https://doi.org/10.2298/aadm180713023b